const math.bias

21 uses

	math (current package)
		bits.go#L14: 	bias     = 1023
		floor.go#L95: 	if e < bias {
		floor.go#L98: 		if e == bias-1 {
		floor.go#L101: 	} else if e < bias+shift {
		floor.go#L107: 		e -= bias
		floor.go#L134: 	if e >= bias {
		floor.go#L140: 		e -= bias
		floor.go#L143: 	} else if e == bias-1 && bits&fracMask != 0 {
		fma.go#L116: 	pe := xe + ye - bias + 1
		fma.go#L163: 	if pe > 1022+bias || pe == 1022+bias && (m+1<<9)>>63 == 1 {
		frexp.go#L34: 	exp += int((x>>shift)&mask) - bias + 1
		frexp.go#L36: 	x |= (-1 + bias) << shift
		ldexp.go#L33: 	exp += int(x>>shift)&mask - bias
		ldexp.go#L49: 	x |= uint64(exp+bias) << shift
		logb.go#L51: 	return int((Float64bits(x)>>shift)&mask) - bias + exp
		modf.go#L34: 	e := uint(x>>shift)&mask - bias
		sqrt.go#L118: 	exp -= bias // unbias exponent
		sqrt.go#L143: 	ix = q>>1 + uint64(exp-1+bias)<<shift // significand + biased exponent
		trig_reduce.go#L39: 	exp := int(ix>>shift&mask) - bias - shift
		trig_reduce.go#L60: 	e := uint64(bias - (lz + 1))